Rapid Programming with Graph Rewrite Rules1
نویسنده
چکیده
Graphs play an important role within many areas of computer science and rule-based languages are more and more used to describe complex transformation or inference processes. Nevertheless, their combination in the form of graph rewriting systems were more or less unknown among computer scientists for a long time. Nowadays, the situation is gradually improving with the appearance of a number of graph rewriting system implementations. Currently, the multi-paradigm language PROGRES is the most expressive implemented graph rewriting language. It has the flavor of a visual database definition and programming language and combines the advantages of attributed (graph) grammars with rule-oriented as well as imperative programming. An integrated set of tools supports editing, analyzing, and debugging of applications as well as translation into procedural programming languages (C, Modula-2).
منابع مشابه
The Expressive, Convenient and Fast Graph Rewrite System
GrGen.NET is a generative programming system for graph rewriting, transforming intuitive and expressive rewrite rule specifications into highly efficient .NET code. The user is supported by a convenient environment consisting of a graph viewer, an interactive shell with integrated debugging support, and an elegant domain specific language for the combination of rewrite rules. After rapid protot...
متن کاملProgram Graph Transformation
Graph transformation, a branch of theoretical computer science, is about the definition of graph languages by grammars, and the study of computations on graphs by rewrite rules. In this paper, we sketch a software engineering problem – the refactoring of object-oriented software – and indicate how graph grammars and graph rewrite rules can be extended for specifying and implementing refactoring...
متن کاملA Trully Concurrent Semantics for the K Framework Based on Graph Transformations
This paper gives a truly concurrent semantics with sharing of resources for the K semantic framework, an executable (term-)rewritingbased formalism for defining programming languages and calculi. Akin to graph rewriting rules, the K (rewrite) rules explicitly state what can be concurrently shared with other rules. The desired true concurrency is obtained by translating the K rules into a novel ...
متن کاملAspect Weaving with Graph Rewriting
This paper introduces GRS-based AOP which explains a large subclass of AOP weavers as graph rewrite systems (GRS). The corresponding class of AOP problems has a formal background since it inherits all features of graph rewrite systems such as criteria for termination , connuence, and unique normal forms. In particular, it it shown that diierent kinds of rewrite rules form diierent weaver classe...
متن کاملModeling DNA Nanodevices Using Graph Rewrite Systems
DNA based nanostructures and devices are becoming ubiquitous in nanotechnology with rapid advancements in theory and experiments in DNA self-assembly which have led to a myriad of DNA nanodevices. However, the modeling methods used by researchers in the field for design and analysis of DNA nanostructures and nanodevices have not progressed at the same rate. Specifically, there does not exist a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994